Testing Graph Blow-Up
نویسندگان
چکیده
Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Specifically, for every fixed graph H , we consider the set of all graphs that are obtained by a (possibly unbalanced) blow-up of H . We show a non-adaptive tester of query complexity e O(1/ǫ) that distinguishes graphs that are a blow-up of H from graphs that are ǫ-far from any such blow-up.
منابع مشابه
On the lowest level of query complexity in testing graph properties
In this thesis, we continue the work of Goldreich and Ron in (ECCC 2008) by presenting an in nite family of natural properties of dense graphs having non-adaptive testers of query complexity of Õ(1/2) , where 2 is the proximity parameter. Speci cally, for every xed graph H , we show a non-adaptive tester of query complexity Õ(2−1) for the property of being a blow-up H . This considerably extend...
متن کاملA note on blow-up in parabolic equations with local and localized sources
This note deals with the systems of parabolic equations with local and localized sources involving $n$ components. We obtained the exponent regions, where $kin {1,2,cdots,n}$ components may blow up simultaneously while the other $(n-k)$ ones still remain bounded under suitable initial data. It is proved that different initial data can lead to different blow-up phenomena even in the same ...
متن کاملAn efficient algorithm for the density Turán problem of some unicyclic graphs
Let H = (V (H), E(H)) be a simple connected graph of order n with the vertex set V (H) and the edge set E(H). We consider a blow-up graph G[H ]. We are interested in the following problem. We have to decide whether there exists a blow-up graph G[H ], with edge densities satisfying special conditions (homogeneous or inhomogeneous), such that the graph H does not appear in a blow-up graph as a tr...
متن کاملThe inducibility of blow-up graphs
The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies, then the resulting graph is called a balanced blow-up. We show that any graph which contains the maximum number of induced copies of a sufficiently large balan...
متن کاملA note on critical point and blow-up rates for singular and degenerate parabolic equations
In this paper, we consider singular and degenerate parabolic equations$$u_t =(x^alpha u_x)_x +u^m (x_0,t)v^{n} (x_0,t),quadv_t =(x^beta v_x)_x +u^q (x_0,t)v^{p} (x_0,t),$$ in $(0,a)times (0,T)$, subject to nullDirichlet boundary conditions, where $m,n, p,qge 0$, $alpha, betain [0,2)$ and $x_0in (0,a)$. The optimal classification of non-simultaneous and simultaneous blow-up solutions is determin...
متن کامل